Topologies and Laplacian spectra of a deterministic uniform recursive tree
نویسندگان
چکیده
منابع مشابه
Topologies and Laplacian spectra of a deterministic uniform recursive tree
The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform recursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the main structural characte...
متن کاملRecursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks.
The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however, determining analytically Laplacian eigenvalues and eigenvectors is a theoretical challenge. In this paper, we study the Laplacian spectra and their corresponding eigenvectors of a class of deterministically growing ...
متن کاملUniform topologies on types
We study the robustness of interim correlated rationalizability to perturbations of higher-order beliefs. We introduce a new metric topology on the universal type space, called uniform-weak topology, under which two types are close if they have similar first-order beliefs, attach similar probabilities to other players having similar first-order beliefs, and so on, where the degree of similarity...
متن کاملLaplacian spectra of recursive treelike small-world polymer networks: analytical solutions and applications.
A central issue in the study of polymer physics is to understand the relation between the geometrical properties of macromolecules and various dynamics, most of which are encoded in the Laplacian spectra of a related graph describing the macrostructural structure. In this paper, we introduce a family of treelike polymer networks with a parameter, which has the same size as the Vicsek fractals m...
متن کاملThe Laplacian of a uniform hypergraph
In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-uniform hypergraph. We show that the real parts of all the eigenvalues of the Laplacian are in the interval [0, 2], and the real part is zero (respectively two) if and only if the eigenvalue is zero (respectively two). All the H+-eigenvalues of the Laplacian and all the smallest H+-eigenvalues of its sub-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2008
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2008-00262-2